A Parameterised Module System for Constructing Typed Logic Programs
نویسنده
چکیده
The paper is concerned with the design of a module system for logic programming so as to satisfy many of the requirements of software en gineering. The design is based on the language Godel which is a logic programming language which already has a simple type and module system. The module system described here ex tends the Godel module system so as to include parameterised modules. In particular, this ex tended system allows general purpose predi cates that depend on facts and rules for specific applications to be defined in modules that are independent of their applications.
منابع مشابه
Local Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus
Programs written in value-passing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we deene a value-based alternation-free modal-calculus built from typed variables, pattern-matching modalities, and parameterised xed point operators. The ver...
متن کاملOn modular termination proofs of general logic programs
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider programs consisting of a hierarchy of modules and supply a general result for proving termination by dealing with each module separately. For programs which ...
متن کاملAn untrusted verifier for Typed Assembly Language
I present the results of constructing a fully untrusted verifier for memory safety of Typed Assembly Language programs, using the Open Verifier architecture. The verifier is untrusted in the sense that its soundness depends only on axioms about the semantics of a concrete machine architecture, not on any axioms specific to a type system. This experiment served to evaluate both the expressivenes...
متن کاملA Declarative Semantics for Typed Logic Programs
Many typed (sorted) logic programming languages are based on sorted logics in which there is typically a set of well-sortedness rules in addition to the ordinary well-formedness rules. An advantage of this approach is that type checking is typically decidable. However such an approach restricts the expressiveness of typed logic programming language. On the other hand, there is another approach ...
متن کاملUsing Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping
We consider a general prescriptive type system with parametric polymorphism and subtyping for logic programs. The property of subject reduction expresses the consistency of the type system w.r.t. the execution model: if a program is"well-typed", then all derivations starting in a"well-typed"goal are again"well-typed". It is well-established that without subtyping, this property is readily obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993